PENERAPAN ALGORITMA K-NEAREST NEIGHBOUR UNTUK MENGIDENTIFIKASI JENIS BIJI KOPI ARABIKA DAN ROBUSTA
نویسندگان
چکیده
منابع مشابه
Determination Of Coffee Content In Coffee Mixtures
The Malaysian Food Regulations 1985 [1] states that coffee mixtures must contain not less than 50 percent coffee. Caffeine content of a coffee mixture is usually used to indicate its coffee level. In this study, coffee content of coffee mixtures was determined based on caffeine concentrations using High Performance Liquid Chromatography (HPLC). Caffeine recoveries from spiked standard coffee mi...
متن کاملEfektivitas Zat Antibakteri Biji Mimba (Azadirachta indica) untuk Menghambat Pertumbuhan Salmonella thyposa dan Staphylococcus aureus
Neem (Azadirachta indica) is a multifunction plant. Its leaves and seeds can be used as a traditional medicine. One of the benefits of neem seeds is that they can serve as antibacteria. It happens because neem seeds contain certain substances which can impede the growth of Salmonella thyposa and Staphylococcus aureus bacteria. The aims of this research were to find out the efectiveness of soaki...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملSmall components in k-nearest neighbour graphs
Let G = Gn,k denote the graph formed by placing points in a square of area n according to a Poisson process of density 1 and joining each point to its k nearest neighbours. In [2] Balister, Bollobás, Sarkar and Walters proved that if k < 0.3043 logn then the probability that G is connected tends to 0, whereas if k > 0.5139 logn then the probability that G is connected tends to 1. We prove that,...
متن کاملConvergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missingness is independent of unobserved values (MAR), and assume there is a minimum positive probability of a response vector being complete. Then RKNN, with k equal to the square root of the sample size, asymptotically produ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatik : Jurnal Ilmu Komputer
سال: 2020
ISSN: 2655-139X,0216-4221
DOI: 10.52958/iftk.v15i2.1426